# -*- coding: UTF-8 -*-
from typing import List
from leetcode_helper import TestcaseHelper, SolutionBase


class Solution(SolutionBase):
    # 解题的方法，命名和Leetcode的保持一致即可
    def findIntegers(self, n: int) -> int:
        def get_binary_str(n: int) -> str:
            return bin(n)[2:]

        dp = [0] * 32
        dp[0] = 1
        dp[1] = 2

        for i in range(2, 32):
            dp[i] = dp[i - 1] + dp[i - 2]

        bin_str = get_binary_str(n)

        ans = 0

        for i in range(len(bin_str)):
            if bin_str[i] == '0':
                continue
            ans += dp[len(bin_str) - i - 1]
            if i != 0 and bin_str[i - 1] == '1':
                return ans

        ans += 1
        return ans


if __name__ == '__main__':
    solution = Solution()

    # 按照leetcode的题目说明，将基本的test case填入
    # 每条case的最后一个元素是正确的结果，即期待的结果
    # 使用元组来保存输入的数据，期待的结果
    testcases = [
        (5, 5),
        (1, 2),
        (2, 3)
    ]

    for case_item in testcases:
        # 获取测试用的case和期待的执行结果
        input1 = case_item[0]
        expect = case_item[len(case_item) - 1]

        exec_result = solution.findIntegers(input1)

        # 判断执行结果，输出提示信息
        check_result = solution.check_result(expect, exec_result)
        TestcaseHelper.print_case(check_result, case_item, exec_result)

